Quantified Mu-Calculus for Control Synthesis

نویسندگان

  • Stéphane Riedweg
  • Sophie Pinchinat
چکیده

We consider an extension of the mu-calculus as a general framework to describe and synthesize controllers. This extension is obtained by quantifying atomic propositions, we call the resulting logic quanti ed mu-calculus. We study its main theoretical properties and show its adequacy to control applications. The proposed framework is expressive : it o ers a uniform way to describe as varied parameters as the kind of systems (closed or open), the control objective, the type of interaction between the controller and the system, the optimality criteria (fairness, maximally permissive), etc. To our knowledge, none of the former approaches can capture such a wide range of concepts Key-words: Mu-calculus, quanti ed mu-calculus, synthesis, control, supervisory, optimaly criteria Mu-calcul quanti é pour la synthèse de controlleurs Résumé : Nous considérons une extension du mu-calcul pour la description et la synthèse de contrôleurs. Cette extension est obtenue par quanti cation des propositions atomiques, nous appelons le mu-calcul quanti é la logique résultante. Nous étudions ses aspects théoriques et son adéquation aux problèmes de contrôle. Le cadre que nous proposons est expressif: il o re un moyen uniforme de décrire di érents paramètres comme le type de système (ouvert ou fermé), l'objectif de contrôle, le type d'interaction entre le contrôleur et le système, des critères d'optimalité (équité, permissivité maximale), etc. A notre connaissance, aucune des approches existantes ne de saisir un si vaste ensemble de concepts. Mots-clés : Mu-calcul, mu-calcul quanti é, synthèse, contrôleurs, superviseurs, critères d'optimalité

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A decidable class of problems for control under partial observation

The commonly accepted control theory for discrete event systems, due to Ramadge and Wonham [13], followed by several other [17,4], has been more recently extended to temporal logic specifications [8,2,14]. Control consists in supervising a plant to guarantee some desired behavior, called control objectives; the objectives are standard properties such as non-blocking, safety, temporal logic defi...

متن کامل

Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures

The emerging technology of interacting systems calls for new verification methods to ensure their reliability. Concurrent Game Structures are expressive abstract models for which several logics have been studied. Yet, these logics are not sufficiently expressive to support certain strategic situation which arise naturally. We propose a second-order mu-calculus enabling a straightforward specifi...

متن کامل

Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus

We study normalization in the simply typed lambda-mu calculus, an extension of lambda calculus with control flow operators. Using an enriched version of the Yoneda embedding, we obtain a categorical normal form function for simply typed lambda-mu terms, which gives a special kind of a call-by-name denotational semantics particularly useful for deciding equalities in the lambda-mu calculus.

متن کامل

Nondeterministic controllers of nondeterministic processes

The controller synthesis problem as formalized by Ramadge and Wonham consists of finding a finite controller that when synchronized with a given plant results in a system satisfying a required property. In this setting, both a plant and a controller are deterministic finite automata, while synchronization is modelled by a synchronous product. Originally, the framework was developed only for saf...

متن کامل

Explicit Substitutions for the Lambda � Mu Calculus �

We present a con uent rewrite system which extents a previous calculus of explicit substitu tions for the lambda calculus HaLe to Parigot s untyped lambda mu calculus Par This extension embeds the lambda mu calculus as a sub theory and provides the basis for a theoretical framework to study the abstract properties of implementations of functional pro gramming languages enriched with control str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003